Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Term Paper: Data Structures

    Uploaded by

    Inderpal Singh
    The document is a term paper on data structures that discusses binary trees. It provides definitions for binary trees, describing them as tree data structures where each node has at most two child nodes. It then outlines several common operations on binary trees, including insertion, deletion, and different traversal orders like pre-order, in-order, and post-order traversals. Finally, it briefly mentions depth-first order, breadth-first order, and how binary trees are defined in type theory.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    Term Paper: Data Structures

    Uploaded by

    Inderpal Singh
    27 views5 pages
    The document is a term paper on data structures that discusses binary trees. It provides definitions for binary trees, describing them as tree data structures where each node has at most two child nodes. It then outlines several common operations on binary trees, including insertion, deletion, and different traversal orders like pre-order, in-order, and post-order traversals. Finally, it briefly mentions depth-first order, breadth-first order, and how binary trees are defined in type theory.

    Original Title

    mani

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a term paper on data structures that discusses binary trees. It provides definitions for binary trees, describing them as tree data structures where each node has at most two child nodes. It then outlines several common operations on binary trees, including insertion, deletion, and different traversal orders like pre-order, in-order, and post-order traversals. Finally, it briefly mentions depth-first order, breadth-first order, and how binary trees are defined in type theory.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    27 views5 pages

    Term Paper: Data Structures

    Uploaded by

    Inderpal Singh
    The document is a term paper on data structures that discusses binary trees. It provides definitions for binary trees, describing them as tree data structures where each node has at most two child nodes. It then outlines several common operations on binary trees, including insertion, deletion, and different traversal orders like pre-order, in-order, and post-order traversals. Finally, it briefly mentions depth-first order, breadth-first order, and how binary trees are defined in type theory.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 5

    Term Paper

    DATA STRUCTURES

    By:-Manish kumar RK3R15 B17 To: - Mr. Aman Kamboj

    Introduction
    A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the "root" node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left or right child. Binary trees are used to implement binary search trees and binary heaps.

    Common operations
    There are a variety of different operations that can be performed on binary trees. Some are mutator operations,

    while others simply return useful information about the tree.

    Insertion
    Nodes can be inserted into binary trees in between two other nodes or added after an external node. In binary trees, a node that is inserted is specified as to which child it is.

    External

    Nodes

    Say that the external node being added on to is node A. To add a new node after node A, A assigns the new node as one of its children and the new node assigns node A as its parent.

    Internal nodes
    The process of inserting a node into a binary tree Insertion on internal nodes is slightly more complex than on external nodes. Say that the internal node is node A and that node B is the child of A. (If the insertion is to insert a right child, then B is the right child of A, and

    similarly with a left child insertion.) A assigns its child to the new node and the new node assigns its parent to A. Then the new node assigns its child to B and B assigns its parent as the new node.

    Deletion
    Deletion is the process whereby a node is removed from the tree. Only certain nodes in a binary tree can be removed unambiguously.

    Pre-order, in-order, and post-order traversal


    Pre-order, in-order, and post-order traversal visit each node in a tree by recursively visiting each node in the left and right subtrees of the root. If the root node is visited before its subtrees, this is pre-order; if after, postorder; if between, in-order. In-order traversal is useful in binary search trees, where this traversal visits the nodes in increasing order.

    Depth-first order

    In depth-first order, we always attempt to visit the node farthest from the root that we can, but with the caveat that it must be a child of a node we have already visited. Unlike a depth-first search on graphs, there is no need to remember all the nodes we have visited, because a tree cannot contain cycles. Pre-order is a special case of this. See depth-first search for more information.

    Breadth-first order

    Contrasting with depth-first order is breadth-first order, which always attempts to visit the node closest to the root that it has not already visited. See breadth-first search for more information. Also called a level-order traversal.

    Type theory
    In type theory, a binary tree with nodes of type A is defined inductively as TA = . 1 + A .

    You might also like