binary tree

$10-30 USD

クローズ

投稿日:

約9年前

$10-30 USD

完了時にお支払い

1. Insert, into an empty binary search tree, entries with keys 3, 8, 20, 15, 30, 17, 5, 35, 19, 18, 16 (in this order). Draw this tree. Now delete 8 from the tree and draw the final tree. 2. Insert, into an empty AVL tree, entries with keys 3, 8, 20, 15, 30, 17, 5, 35, 19, 18, 16 (in this order). Draw the tree before and after each rebalancing step as well as the final tree. 3. Prove or disprove the claim that the order in which a fixed set of elements is inserted into a binary search tree does not affect the structure of the tree, i.e., that the same tree results no matter in which order the elements are inserted. 4. Prove or disprove the claim that the order in which a fixed set of elements is inserted into an AVL tree does not affect the structure of the tree, i.e., that the same tree results no matter in which order the elements are inserted. 5. Explain how to use an AVL tree to sort n comparable elements in O(n log n) time in the worst case.

PHP

Software Architecture

プロジェクト ID: 7514385

プロジェクトについて

1個の提案

リモートプロジェクト

アクティブ 9年前

お金を稼ぎたいですか？

メールアドレス

Freelancerで入札する利点

予算と期間を設定してください

仕事で報酬を得る

提案をご説明ください

登録して仕事に入札するのは無料です

この仕事に1人のフリーランサーが、平均$25 USDで入札しています

@luckysrikant

Hi, Using canvas in html page we can insert the values in to the BST. I will design the binary tree dynamically using Canvas visuals. It will also have features to add/delete elements. The canvas will easily support the drawings and it will be easy to show to rotations in AVL tree when the balancing of nodes will be performed. The algorithm for the AVL is going to be bit complex because of the rotations and deletions. Hence I need at least 3 days to complete this with valid test case scenarios. Thanks Srikant

$25 USD 3日以内