×
Stay dedicated because great things takes time.
--Your friends at LectureNotes
Close

Note for Data Structure and Algorithms - DSA by shelly copper

  • Data Structure and Algorithms - DSA
  • Note
  • 32 Views
  • Uploaded 9 months ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

TREE Tree is a non-linear data structure which organizes data in hierarchical structure and this is a recursive definition. In tree data structure, every individual element is called as Node. Node in a tree data structure, stores the actual data of that particular element and link to next element in hierarchical structure. For e.g-

Text from page-2

Binary Tree A binary tree is a data structure in which each node has at most two children ,which are referred to as the left child and the right child. for e.g-

Text from page-3

Binary Search TreeBinary Search Tree, is a node-based binary tree data structure which has the following properties: • The left subtree of a node contains only nodes with values less than the root’s value. • The right subtree of a node contains only nodes with value greater than the root’s value. • The left and right subtree each must also be a binary search tree. There must be no duplicate nodes.

Text from page-4

• For example -

Lecture Notes