IMPLEMENTING FIND AND INSERT IN A BINARY SEARCH TREE

PRINT A BST IN ORDER

CHECK IF A TREE IS A BST

Microsoft - Elsevier to organize next WSDM cup

Glad to announce that Microsoft and Elsevier will organize the next wsdm cup. With @kuansan https://lnkd.in/bysr6QV 

In the recent explosive growth of online activities, the data are often recorded as heterogeneous graphs, ranging from Facebook’s Open Graph that record our social and communication activities to the graphs gathered by major search engine companies that represent a snapshot of our collective knowledge. As demonstrated in many web search and data mining applications, a critical element to make the best use of the data is the ability to assess the relative importance of the nodes.
In the 2016 WSDM Cup, the challenge will be to assess the query-independent importance of scholarly articles, using data from the Microsoft Academic Graph--a large heterogeneous graph comprised of publications, authors, venues, organizations, and the fields of study.

More details coming soon. Stay tuned.

Organizers
Alex Wade, Microsoft Research
Kuansan Wang, Microsoft Research
Antonio Gulli, Elsevier B.V.

IMPLEMENTING FINDMIN AND FINDMAX IN A BST

IMPLEMENTING A SKIPLIST

IMPLEMENTING TRIES

IMPLEMENTING A SEGMENT TREE

IMPLEMENTING RANGE MINIMUM QUERIES

Given a Binary Search Tree, find the size of the largest independent set of nodes

IMPLEMENTING A POSTORDER VISIT FOR A BINARY TREE

IMPLEMENTING SUFFIX TREE

Optimal Binary Tree – given a set S of tuples , where k is an integer and freq[k] is the number of times that k has been observed, build a binary search three such that the total cost of all single searches is minimized

COUNTING THE NUMBER OF LEAVES IN A TREE

Scheduling – given n jobs, each one with a processing time ti , a profit pi and a deadline di, maximize the profit

IMPLEMENTING A DIRECT GRAPH

ERDŐS NUMBER

CHOOSING MATRICES OR ADJACENCY LISTS

IMPLEMENTING A BFS VISIT

GIVEN TWO NODES IN AN UNDIRECTED GRAPH, FIND THE PATH CONNECTING THEM

HOW TO DETECT A CYCLE IN A GRAPH

IMPLEMENTING A DFS VISIT

RECONSTRUCTING A TREE GIVEN ITS PRE-ORDER AND IN-ORDER TRAVERSALS

IMPLEMENTING PREORDER VISIT FOR A BINARY TREE