Show Navigation

Public
- Public
- Network
- Groups
- Popular
- People

Conversation

Notices

bitey cat bite bite bite bite (cybermeow@cybre.space)'s status on Friday, 01-Dec-2017 01:16:10 EST bitey cat bite bite bite bite

@radtabby you want to BST in C?
make a struct. in the struct are two pointers to instances of the same struct.
The idea is that one pointer is left and the other one is right. the left pointer holds smaller values and the right pointer holds larger values.

In conversation Friday, 01-Dec-2017 01:16:10 EST from cybre.space permalink
1. bitey cat bite bite bite bite (cybermeow@cybre.space)'s status on Friday, 01-Dec-2017 01:16:58 EST bitey cat bite bite bite bite
  in reply to
  
  @radtabby http://www.zentut.com/c-tutorial/c-binary-search-tree/
  In conversation Friday, 01-Dec-2017 01:16:58 EST from cybre.space permalink
  Attachments
  1. Invalid filename.
    
    C Binary Search Tree
    
    from ZenTut
    
    This tutorial introduces you to binary search tree data structure and how to implement it in C

Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.

All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.

Switch to desktop site layout.