hard20 pts · first answer countsgraphsunion-find
Union-find without either optimisation
A union-find links root(a) under root(b) with no rank and no path compression. Calls are union(1,2), union(2,3), ..., union(n-1,n), then find(1) many times. What is the cost of each find(1)?
Discussion 0
Join free to post in the discussion.
Related questions
- Edges in a tree with n nodesBackend Developer
- Most nodes in a binary tree of height 3Backend Developer
- What inorder traversal of a BST givesBackend Developer
- Preorder output of a small treeBackend Developer
- Traversal for freeing a whole treeBackend Developer
- Data structure for level-order traversalBackend Developer
- BST search time, typical and worstBackend Developer
- Leaves in a full binary treeBackend Developer